Making Laplacians commute

نویسندگان

  • Michael M. Bronstein
  • Klaus Glashoff
  • Terry A. Loring
چکیده

In this paper, we construct multimodal spectral geometry by finding a pair of closest commuting operators (CCO) to a given pair of Laplacians. The CCOs are jointly diagonalizable and hence have the same eigenbasis. Our construction naturally extends classical data analysis tools based on spectral geometry, such as diffusion maps and spectral clustering. We provide several synthetic and real examples of applications in dimensionality reduction, shape analysis, and clustering, demonstrating that our method better captures the inherent structure of multi-modal data.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Making Laplacians Commute: Multimodal Spectral Geometry Using Closest Commuting Operators∗

In this paper, we construct multimodal spectral geometry by finding a pair of closest commuting operators (CCO) to a given pair of Laplacians. The CCOs are jointly diagonalizable and hence have the same eigenbasis. We show that our problem is equivalent to joint diagonalization, however, unlike joint diagonalization, allows to explicitly preserve the properties of Laplacians. Our construction n...

متن کامل

Synchronized state of coupled dynamics on time-varying networks.

We consider synchronization properties of coupled dynamics on time-varying networks and the corresponding time-average network. We find that if the different Laplacians corresponding to the time-varying networks commute with each other then the stability of the synchronized state for both the time-varying and the time-average topologies are approximately the same. On the other hand for noncommu...

متن کامل

Generalized Laplacians and First Transit Times for Directed Graphs

In this paper, we extend previous results on average commute-times for undirected graphs to fully-connected directed graphs, corresponding to irreducible Markov chains. We introduce an unsymmetrized generalized Laplacian matrix and show how its pseudo-inverse directly yields the one-way first-transit times and round-trip commute times with formulas almost matching those for the undirected graph...

متن کامل

A Combinatorial View of Graph Laplacians

Discussions about different graph Laplacians—mainly the normalized and unnormalized versions of graph Laplacian—have been ardent with respect to various methods of clustering and graph based semi-supervised learning. Previous research in the graph Laplacians, from a continuous perspective, investigated the convergence properties of the Laplacian operators on Riemannian Manifolds. In this paper,...

متن کامل

High-Ordered Random Walks and Generalized Laplacians on Hypergraphs

Despite of the extreme success of the spectral graph theory, there are relatively few papers applying spectral analysis to hypergraphs. Chung first introduced Laplacians for regular hypergraphs and showed some useful applications. Other researchers treated hypergraphs as weighted graphs and then studied the Laplacians of the corresponding weighted graphs. In this paper, we aim to unify these ve...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • CoRR

دوره abs/1307.6549  شماره 

صفحات  -

تاریخ انتشار 2013